Multiplicative Order of Gauss Periods
نویسندگان
چکیده
We obtain a lower bound on the multiplicative order of Gauss periods which generate normal bases over finite fields. This bound improves the previous bound of J. von zur Gathen and I. E. Shparlinski.
منابع مشابه
Gauss periods: orders and cryptographical applications
Experimental results on the multiplicative orders of Gauss periods in finite fields are presented. These results indicate that Gauss periods have high order and are often primitive (self-dual) normal elements in finite fields. It is shown that Gauss periods can be exponentiated in quadratic time. An application is an efficient pseudorandom bit generator.
متن کاملOrder of Gauss periods in large characteristic ∗ †
Let p be the characteristic of Fq and let q be a primitive root modulo a prime r = 2n + 1. Let β ∈ Fq2n be a primitive rth root of unity. We prove that the multiplicative order of the Gauss period β + β−1 is at least (log p)c logn for some c > 0. This improves the bound obtained by Ahmadi, Shparlinski and Voloch when p is very large compared with n. We also obtain bounds for ”most” p.
متن کاملExplicit Multiplicative Relations between Gauss Sums
H. Hasse conjectured that all multiplicative relations between Gauss sums essentially follow from the Davenport-Hasse product formula and the norm relation for Gauss sums. While this is known to be false, very few counterexamples, now known as sign ambiguities, have been given. Here, we provide an explicit product formula giving an infinite class of new sign ambiguities and resolve the ambiguou...
متن کاملA fast Gauss-Newton parallel-cascade adaptive truncated Volterra filter
This paper introduces a computationally e cient Gauss-Newton type adaptation algorithm for parallel-cascade realizations of truncated Volterra systems with arbitrary, but nite order nonlinearity. Parallel-cascade realizations implement higher-order Volterra systems using parallel and multiplicative combinations of lower-order Volterra systems. The complexity of our system is comparable to the c...
متن کاملGreedy and Randomized Versions of the Multiplicative Schwarz Method
We consider sequential, i.e., Gauss-Seidel type, subspace correction methods for the iterative solution of symmetric positive definite variational problems, where the order of subspace correction steps is not deterministically fixed as in standard multiplicative Schwarz methods. Here, we greedily choose the subspace with the largest (or at least a relatively large) residual norm for the next up...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007